Winner determination in combinatorial auctions with logic-based bidding languages
نویسندگان
چکیده
We propose the use of logic-based preference representation languages based on weighted propositional formulas for specifying bids in a combinatorial auction. We then develop several heuristics for a branch-and-bound search algorithm for determining the winning bids in this framework and report on their empirical performance. The logic-based approach is attractive due to its high degree of flexibility in designing a range of different bidding languages within a single conceptual framework.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملCombinatorial Auctions with Externalities: Basic Properties and Bidding Languages
Although combinatorial auctions have received a great deal of attention from the computer science community over the past decade, research in this domain has focused on settings in which a bidder only has preferences over the bundles of goods they themselves receive, and is indifferent about how other goods are allocated to other bidders. In general, however, bidders in combinatorial auctions w...
متن کاملBIDFLOW: a New Graph-Based Bidding Language for Combinatorial Auctions
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid) representing her bids. The interpretation of the winner determination problem as an aggregation of individual preferences represented as flowbids allows building an aggregate netbid for its representation. Labelling ...
متن کاملModelling Combinatorial Auctions in Linear Logic
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear logic can easily represent bids in combinatorial auctions in which goods may be sold in multiple units, and we show how it naturally generalises several bidding languages familiar from the literature. Moreover, the winn...
متن کاملBidding Languages for Combinatorial Auctions
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutabilityand complementarity. Most algorithms are designed to work with explicit bids for concrete bundles of goods. However, logical bidding languages allow the expression of complex utility functions in a natural and concise way. W...
متن کامل